Euler index in uncertain graph

نویسندگان

  • Bo Zhang
  • Jin Peng
چکیده

As the complexity of a system increases, in practical application of graph theory, different types of uncertainty are frequently encountered. In an uncertain graph, whether two vertices of the graph are joined cannot be completely determined. Within the framework of uncertainty theory, the concept of Euler index of uncertain graph is proposed. It also gives a method to calculate Euler index of uncertain graph. What’s more, the Euler index of uncertain cycle and uncertain graph with blocks can be obtained in a simple way.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euler index of uncertain random graph: concepts and properties

This paper considers the Euler tour of an uncertain random graph, in which some edges exist with some degrees in uncertain measure and others exist with some degrees in probability measure. The concept of Euler index of an uncertain random graph is proposed first, and then a method to calculate the Euler index of an uncertain random graph is given. In addition, some properties of the Euler inde...

متن کامل

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

متن کامل

Connectedness Index of uncertain Graph

The connectivity of graph is a basic concept of graph theory. Since originated in seven bridges problem by Euler in 1736, the main study of graph theory unfolds on the assumption that the graph is connected. In classic graph theory, the edges and the vertices are all deterministic, and connectivity of the graph can be easily verified. However, in practical application, non-deterministic factors...

متن کامل

Hamilton Index and Its Algorithm of Uncertain Graph

In practical applications of graph theory, uncertain factors are frequently encountered. In this paper, the uncertainty theory is employed to deal with uncertain factors in uncertain graph, in which whether two vertices are joined by an edge cannot be completely determined. In order to show how likely an uncertain graph is Hamiltonian, the concept of Hamilton index of uncertain graph is propose...

متن کامل

Group consensus for heterogeneous multi-agent systems with parametric uncertainties

In this paper, a group consensus problem is investigated for the heterogeneous agents that are governed by the Euler–Lagrange system and the double-integrator system, respectively, and the parameters of the Euler–Lagrange system are uncertain. To achieve group consensus, a novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed. By combining algebrai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 218  شماره 

صفحات  -

تاریخ انتشار 2012